Lower Semilattice-Ordered Residuated Semigroups and Substructural Logics

نویسنده

  • Szabolcs Mikulás
چکیده

We look at lower semilattice-ordered residuated semigroups and, in particular, the representable ones, i.e., those that are isomorphic to algebras of binary relations. We will evaluate expressions (terms, sequents, equations, quasi-equations) in representable algebras and give finite axiomatizations for several notions of validity. These results will be applied in the context of substructural logics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On representable ordered residuated semigroups

We show that the equational theory of representable lattice-ordered residuated semigroups is not finitely axiomatizable. We apply this result to the problem of completeness of substructural logics.

متن کامل

The equational theories of representable residuated semigroups

We show that the equational theory of representable lower semilattice-ordered residuated semigroups is finitely based. We survey related results.

متن کامل

Closure Operators and Complete Embeddings of Residuated Lattices

In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follows, including various types of completeness theorems of substructural logics.

متن کامل

Title Closure operators and complete embeddings of residuated lattices

In this paper, a theorem on the existence of complete embedding of partially ordered monoids into complete residuated lattices is shown. From this, many interesting results on residuated lattices and substructural logics follows, including various types of completeness theorems of substructural logics.

متن کامل

Structure Theorem for a Class of Group-like Residuated Chains à la Hahn

Hahn’s famous structure theorem states that totally ordered Abelian groups can be embedded in the lexicographic product of real groups. Our main theorem extends this structural description to order-dense, commutative, group-like residuated chains, which has only finitely many idempotents. It is achieved via the so-called partial-lexicographic product construction (to be introduced here) using t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Studia Logica

دوره 103  شماره 

صفحات  -

تاریخ انتشار 2015